Combinatorial Structures Behind Binary Generalized NTU Sequences

نویسندگان

چکیده

This paper concentrates on a class of pseudorandom sequences generated by combining q-ary m-sequences and quadratic characters over finite field odd order, called binary generalized NTU sequences. It is shown that the relationship among sub-sequences can be formulated as combinatorial structures Hadamard designs. As consequence, generalize group structure discovered Kodera et al. (IEICE Trans. Fundamentals, vol.E102-A, no.12, pp.1659-1667, 2019) lead to finite-geometric explanation for investigated structure.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Smart Structures Research at Ntu

Smart Structures is a rapidly advancing field with the range of support and enabling technologies having made significant advances, notably optics and electronics. Whilst piezoelectric actuators and fiber optic sensors have been accorded the most attention, other techniques such as Shape Memory Alloys, Magneto Restrictive Materials and Electro-Rheological Fluids also have niche applications. Fu...

متن کامل

Algebraic and combinatorial structures on pairs of twin binary trees

We give a new construction of a Hopf algebra defined first by Reading [Rea05] whose bases are indexed by objects belonging to the Baxter combinatorial family (i.e., Baxter permutations, pairs of twin binary trees, etc.). Our construction relies on the definition of the Baxter monoid, analog of the plactic monoid and the sylvester monoid, and on a RobinsonSchensted-like correspondence and insert...

متن کامل

Identities Involving Generalized Harmonic Numbers and Other Special Combinatorial Sequences

In this paper, we study the properties of the generalized harmonic numbersHn,k,r(α, β). In particular, by means of the method of coefficients, generating functions and Riordan arrays, we establish some identities involving the numbers Hn,k,r(α, β), Cauchy numbers, generalized Stirling numbers, Genocchi numbers and higher order Bernoulli numbers. Furthermore, we obtain the asymptotic values of s...

متن کامل

On Generalized Weak Structures

Avila and Molina [1] introduced the notion of generalized weak structures which naturally generalize minimal structures, generalized topologies and weak structures and the structures α(g),π(g),σ(g) and β(g). This work is a further investigation of generalized weak structures due to Avila and Molina. Further we introduce the structures ro(g) and rc(g) and study the properties of the structures r...

متن کامل

Binary Combinatorial Coding

We present a novel binary entropy code called combinatorial coding (CC). The theoretical basis for CC has been described previously under the context of universal coding [1], enumerative coding [2], and minimum description length [3]. The code described in these references works as follows: assume the source data of length M is binary, memoryless, and generated with an unknown parameter θ, the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

سال: 2023

ISSN: ['1745-1337', '0916-8508']

DOI: https://doi.org/10.1587/transfun.2022tal0004